Binary Optimal Linear Rate 1/2 Codes
نویسندگان
چکیده
منابع مشابه
Use of matroid theory to construct a class of good binary linear codes
It is still an open challenge in coding theory how to design a systematic linear (n, k)− code C over GF(2) with maximal minimum distance d. In this study, based on matroid theory (MT), a limited class of good systematic binary linear codes (n, k, d ) is constructed, where n = 2 1 + · · · + 2 δ and d = 2 − 2 + · · · + 2 δ− 1 for k≥ 4, 1≤ δ < k. These codes are well known as special cases of code...
متن کاملBinary Linear Codes with Optimal Scaling and Quasi-Linear Complexity
We present the first family of binary codes that attains optimal scaling and quasi-linear complexity, at least for the binary erasure channel (BEC). In other words, for any fixed δ > 0, we provide codes that ensure reliable communication at rates within ε > 0 of the Shannon capacity with block length n = O(1/ε2+δ), construction complexity Θ(n), and encoding/decoding complexity Θ(n log n). Furth...
متن کاملCode design based on metric-spectrum and applications
Code Design Based on Metric-Spectrum and Applications. (December 2004) Panayiotis D. Papadimitriou, B.S., University of Patras, Greece; M.S., University of Patras, Greece Chair of Advisory Committee: Dr. Costas N. Georghiades We introduced nested search methods to design (n, k) block codes for arbitrary channels by optimizing an appropriate metric spectrum in each iteration. For a given k, the ...
متن کاملOptimal three-weight cubic codes
In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring R = F2+ vF2+ v 2 F2, where v 3 = 1. These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distributions are computed by employing character sums. The three-weight binary linear codes which we construct are shown to be optimal when m i...
متن کاملOptimal Index Codes via a Duality between Index Coding and Network Coding
In Index Coding, the goal is to use a broadcast channel as efficiently as possible to communicate information from a source to multiple receivers which can possess some of the information symbols at the source as side-information. In this work, we present a duality relationship between index coding (IC) and multiple-unicast network coding (NC). It is known that the IC problem can be represented...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 283 شماره
صفحات -
تاریخ انتشار 1999